Message-Aware Graph Attention Networks for Large-Scale Multi-Robot Path Planning

نویسندگان

چکیده

The domains of transport and logistics are increasingly relying on autonomous mobile robots for the handling distribution passengers or resources. At large system scales, finding decentralized path planning coordination solutions is key to efficient performance. Recently, Graph Neural Networks (GNNs) have become popular due their ability learn communication policies in multi-agent systems. Yet, vanilla GNNs rely simplistic message aggregation mechanisms that prevent agents from prioritizing important information. To tackle this challenge, letter, we extend our previous work utilizes by incorporating a novel mechanism allow message-dependent attention. Our Message-Aware Attention neTwork (MAGAT) based key-query-like determines relative importance features messages received various neighboring robots. We show MAGAT able achieve performance close coupled centralized expert algorithm. Further, ablation studies comparisons several benchmark models attention very effective across different robot densities performs stably constraints bandwidth. Experiments demonstrate model generalize well previously unseen problem instances, it achieves 47% improvement over success rate, even large-scale instances ×100 larger than training instances.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph Decomposition for Efficient Multi-Robot Path Planning

In my previous paper (Ryan, 2006) I introduced the concept of subgraph decomposition as a means of reducing the search space in multi-robot planning problems. I showed how partitioning a roadmap into subgraphs of known structure allows us to first plan at a level of abstraction and then resolve these plans into concrete paths without the need for further search so we can solve significantly har...

متن کامل

Cooperative Multi-Robot Path Planning

In risky applications it is advantageous to use multiple robots in order to improve performances. In a research or patrol scenario robots have to move cooperatively in order to avoid collisions and to improve performance. In this paper we describe the implementation of two variations of a cooperative planning algorithm: Cooperative A* and Cooperative Voronoi A*. The task is decoupled into a ser...

متن کامل

Multi-Robot Path Planning for Selective Coverage

In this paper we propose a reward-driven finitehorizon model akin to a Markov Decision Process to extract the maximum amount of valuable data in least amount of time. We present a path planning algorithm that generates off-line trajectories for multiple robots to cover a region of interest by visiting the hot-spots in increasing order of their significance. An underlying distribution is assumed...

متن کامل

Graph search techniques for mobile robot path planning

In a number of applications, the problem of determining the optimum path occurs. This applications range from finding the fastest path in a network, to determining the safest path for mobile vehicle, wandering on the surface of Mars. In this context, we shall limit our scope to the case of finding paths in Euclidean two-dimensional space. Moreover we shall limit the case study to movements alon...

متن کامل

Multi-Robot Path-Planning with Subgraphs

In this paper we consider the problem of planning paths for an homogeneous group of robots around a shared roadmap. We show that significant speedup can be achieved if we decompose the roadmap into subgraphs of known structure, such as stacks and cliques, and build plans hierarchically, first between connected subgraphs, then inside the subgraphs. We show that this approach while suboptimal is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE robotics and automation letters

سال: 2021

ISSN: ['2377-3766']

DOI: https://doi.org/10.1109/lra.2021.3077863